Computing the Stopping Distance of a Tanner Graph Is NP-Hard
نویسندگان
چکیده
منابع مشابه
Unit disk graph recognition is NP-hard
Unit disk graphs are the intersection graphs of unit diameter closed disks in the plane. This paper reduces SATISFIABILITY to the problem of recognizing unit disk graphs. Equivalently, it shows that determining if a graph has sphericity 2 or less, even if the graph is planar or is known to have sphericity at most 3, is NP-hard. We show how this reduction can be extended to 3 dimensions, thereby...
متن کاملNearest Neighbour Graph Realizability is NP-hard
1 I n t r o d u c t i o n This paper investigates the problem of realizing a given graph G as a "nearest neighbour graph" of a set P of points in the plane. Roughly speaking, a "nearest neighbour graph" is a geometric graph formed from a set of points in the plane by joining two points if one is the nearest neighbour of the other. Fig. 1. A mutual nearest neighbour graph One specific kind of ne...
متن کاملPoint visibility graph recognition is NP-hard
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard.
متن کاملOn the Complexity of finding Stopping Distance in Tanner Graphs
Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequence.
متن کاملOn the Complexity of Finding Stopping Distance in Tanner Graphs
— The problem of finding the stopping distance of the Tanner graph for a linear block code is shown to be NP-Hard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2007
ISSN: 0018-9448
DOI: 10.1109/tit.2007.896864